Asymptotic Critical Transmission Radius for $k$-Connectivity in Wireless Ad Hoc Networks
نویسندگان
چکیده
منابع مشابه
Asymptotic critical transmission radius for k-connectivity in wireless ad hoc networks
A range assignment to the nodes in a wireless ad hoc network induces a topology in which there is an edge between two nodes if and only if both of them are within each other’s transmission range. The critical transmission radius for -connectivity is the smallest such that if all nodes have the transmission radius , the induced topology is -connected. In this paper, we study the asymptotic criti...
متن کاملMultihop connectivity in wireless ad hoc networks
Wireless ad hoc networks have numerous real life applications as they can be instantaneously established, require no infrastructure, and are autonomic and selforganizing. Multihop connectivity is the ability of the multiple-hops-away nodes—nodes which are not directly connected—to communicate with each other. Since wireless ad hoc networks are infrastructure-less, the participating nodes themse...
متن کاملCritical Communication Radius for Sink Connectivity in Wireless Networks
Inspired by the thermodynamic limit in random geometric graphs, we propose a notion of sink connectivity for wireless networks. The sink connectivity, denoted Cn, is defined as the fraction of nodes in the network that are connected to the sink. We will show in this paper that if n nodes are randomly placed in a disc of area A and each node’s radius chosen as rn = p Ad/(πn), then the resulting ...
متن کاملThe Critical Neighbourhood Range for Asymptotic Overlay Connectivity in Ad Hoc Networks
We first motivate the use of ad hoc overlays. In particular, we argue that overlay routing could play a role in the spreading of ad hoc networks. We then define a simple criterion for neighbourhood: two overlay nodes are neighbours if and only if there exists a path between them of at most R hops, and R is called the (overlay) neighbourhood range. A small R may result in a disconnected overlay,...
متن کاملThe Critical Neighbourhood Range for Asymptotic Overlay Connectivity in Dense Ad Hoc Networks
Abs t rac t We define, for an overlay built on top of an ad hoc network, a simple criterion for neighbourhood: two overlay nodes are neighbours if and only if there exists a path between them of at most R hops, and R is called the (overlay) neighbourhood range. A small R may result in a disconnected overlay, while an unnecessarily large R would generate extra control traffic. We are interested ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448
DOI: 10.1109/tit.2010.2046254